Mobile Agent Security with Efficient Oblivious Transfer
نویسندگان
چکیده
Cachin et al. and Algesheimer et al. proposed schemes using secure function evaluation for protecting mobile agents in untrusted environments. One of essential ingredients of their protocols is oblivious transfer (although not all of them require it). Unfortunately, naive application of oblivious transfer is inefficient because it must be performed for each bit of encrypted circuit inputs. Therefore, in this paper we propose secure mobile agent protocols with emphasis on efficient oblivious transfer suitable for secure function evaluation.
منابع مشابه
Generalized Non-Interactive Oblivious Transfer Using Count-Limited Objects with Applications to Secure Mobile Agents
Oblivious transfer (OT) is a fundamental primitive used in many cryptographic protocols, including general secure function evaluation (SFE) protocols. However, interaction is a primary feature of any OT protocol. In this paper, we show how to remove the interaction requirement in an OT protocol when parties participating in the protocol have access to slightly modified Trusted Platform Modules,...
متن کاملMobile Agent Security Through Multi-Agent Cryptographic Protocols
We consider the problem of keeping sensitive data and algorithms contained in a mobile agent from discovery and exploitation by a malicious host. The focus in this paper is on rigorous techniques based on cryptographic protocols. Algesheimer, Cachin, Camenisch, and Karjoth (IEEE Security and Privacy, 2001) devised a secure agent protocol in such a setting, where agents and hosts are mutually di...
متن کاملDistributed Oblivious Transfer
This work describes distributed protocols for oblivious transfer, in which the role of the sender is divided between several servers, and a chooser (receiver) must contact a threshold of these servers in order to run the oblivious transfer protocol. These distributed oblivious transfer protocols provide information theoretic security, and do not require the parties to compute exponentiations or...
متن کاملSHADE: Secure HAmming DistancE Computation from Oblivious Transfer
We introduce two new schemes for securely computing Hamming distance in the two-party setting. Our first scheme is a very efficient protocol, based solely on 1-out-of-2 Oblivious Transfer, that achieves full security in the semi-honest setting and one-sided security in the malicious setting. Moreover we show that this protocol is significantly more efficient than the previous proposals, that ar...
متن کاملEfficient Concurrent Oblivious Transfer in Super-Polynomial-Simulation Security
In this paper, we show a concurrent oblivious transfer protocol in super-polynomial-simulation (SPS) security. Our protocol does not require any setup and does not assume any independence among the inputs. In addition, our protocol is efficient since it does not use any inefficient primitives such as general zero-knowledge proofs for all NP statements. This is the first concurrent oblivious tra...
متن کامل